differential propositional calculus ∗
نویسنده
چکیده
calculus Calculus circle Circle collection Collection combination Combination combinations Combinations component Component components Components cover Cover cut Cut divides Divides entire Entire even Even language Language number Number object Object objects Objects parallel Parallel range Range ranges Ranges rank Rank ranks Ranks place Place representation Representation represents Represents simple Simple strictly Strictly system System universe Universe universes Universes weight Weight A differential propositional calculus is a propositional calculus extended by a set of terms for describing aspects of change and difference, for example, processes that take place in a universe of discourse or transformations that map a source universe into a target universe.
منابع مشابه
An analytic study on the Euler-Lagrange equation arising in calculus of variations
The Euler-Lagrange equation plays an important role in the minimization problems of the calculus of variations. This paper employs the differential transformation method (DTM) for finding the solution of the Euler-Lagrange equation which arise from problems of calculus of variations. DTM provides an analytical solution in the form of an infinite power series with easily computable components. S...
متن کاملSimilarity DH-Algebras
In cite{GL}, B. Gerla and I. Leuc{s}tean introduced the notion of similarity on MV-algebra. A similarity MV-algebra is an MV-algebra endowed with a binary operation $S$ that verifies certain additional properties. Also, Chirtec{s} in cite{C}, study the notion of similarity on L ukasiewicz-Moisil algebras. In particular, strong similarity L ukasiewicz-Moisil algebras were defined. In this paper...
متن کاملA reduction of classical propositional logic to the conjunction-negation fragment of an intuitionistic relevant logic
It is well known that the conjunction-negation fragment of the classical propositional calculus coincides with the conjunction-negation fragment of the Heyting propositional calculus (Godel, 1933; Kleene, 1952, $81). Since conjunction and negation form a sufficient basis for classical propositional logic, this reduces, in a certain sense, classical propositional logic to a fragment of Heyting p...
متن کاملA finite model theorem for the propositional μ-calculus
We prove a finite model theorem and infinitary completeness result for the propositional μ-calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of wellquasi-orders.
متن کاملUndecidability of the problem of recognizing axiomatizations for propositional calculi with implication
In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability of the following problem for these calculi: whether a given finite set of propositional formulas constitutes an adequate axiom system for a fixed proposition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013